Minimum spanning tree

Results: 280



#Item
21Graph theory / Mathematics / Spanning tree / Axiom of choice / Tree / Minimum spanning tree / Ear decomposition / Graph connectivity / NP-complete problems / Biconnected component / Vertex cover

Downloadedto. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php SIAM J. COMPUT. Vol. 2, No. 4, DecemberSET MERGING ALGORITHMS*

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2015-11-19 07:35:47
22Search algorithms / Graph theory / Data structures / Information science / Information retrieval / Disjoint-set data structure / Binary trees / Minimum spanning tree / Routing algorithms / Link/cut tree / HeldKarp algorithm

Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWEN

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
23Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Spanning tree / Operations research / Combinatorial optimization / NP-hard problems / Online algorithm / Steiner tree problem / Minimum spanning tree / Travelling salesman problem

CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-03-01 15:15:38
24Spanning tree / NP-complete problems / Routing algorithms / Edsger W. Dijkstra / Combinatorial optimization / Steiner tree problem / Minimum spanning tree / Shortest path problem / Eulerian path / Algorithm / Randomized algorithm / Matching

Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2005-11-30 21:17:11
25Graph theory / Graph / Distributed computing / Distributed minimum spanning tree

Lower Bounds for
 Local Algorithms Jukka Suomela Aalto University, Finland !

Add to Reading List

Source URL: users.ics.aalto.fi

Language: English - Date: 2014-10-12 20:39:47
26Network theory / NP-complete problems / Edsger W. Dijkstra / Graph coloring / Spanning tree / Matching / Shortest path problem / Logical matrix / Treewidth / Matrix / Minimum spanning tree / Clique

Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:11
27NP-complete problems / Combinatorial optimization / Routing algorithms / Search algorithms / Edsger W. Dijkstra / Dominating set / A* search algorithm / Optimization problem / Minimum spanning tree / Shortest path problem / Treewidth / Flow network

Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke Albert-Ludwigs-Universit¨at Freiburg

Add to Reading List

Source URL: ad-publications.informatik.uni-freiburg.de

Language: English - Date: 2013-04-29 10:40:39
28Graph theory / Graph / NetworkX / DOT / Minimum spanning tree / Neighbourhood / Petersen graph / Social network analysis software / Graph Modelling Language

A PRACTICAL GUIDE TO DRAWING AND COMPUTING WITH COMPLEX NETWORKS ROSS M. RICHARDSON Abstract. These notes are an attempt to document various graph drawing resources which I have compiled in the course of my work. They ar

Add to Reading List

Source URL: math.ucsd.edu

Language: English - Date: 2008-09-14 22:41:39
29Statistical classification / Machine learning / Naive Bayes classifier / Supervised learning / Averaged one-dependence estimators / Bayesian network / Feature selection / Minimum spanning tree / X0

Learning Extended Tree Augmented Naive StructuresI Cassio P. de Camposa,∗, Giorgio Coranib , Mauro Scanagattab , Marco Cuccuc , Marco Zaffalonb b Istituto a Queen’s University Belfast, UK Dalle Molle di Studi sull’

Add to Reading List

Source URL: ipg.idsia.ch

Language: English - Date: 2016-03-17 09:50:40
30Cluster analysis / Hierarchical clustering / Network analysis / Mutual information / K-means clustering / Image segmentation / Pattern recognition / Information bottleneck method / Minimum spanning tree / Spectral clustering / Single-linkage clustering / Determining the number of clusters in a data set

Information Theoretic Clustering using Minimum Spanning Trees Andreas C. M¨ uller?1 , Sebastian Nowozin2 , and Christoph H. Lampert3 1

Add to Reading List

Source URL: amueller.github.io

Language: English - Date: 2016-08-04 15:59:56
UPDATE